A Linear-Optical Proof that the Permanent is #P-Hard
نویسنده
چکیده
One of the crown jewels of complexity theory is Valiant’s 1979 theorem that computing the permanent of an n × n matrix is #P-hard. Here we show that, by using the model of linearoptical quantum computing—and in particular, a universality theorem due to Knill, Laflamme, and Milburn—one can give a different and arguably more intuitive proof of this theorem.
منابع مشابه
New Hardness Results for the Permanent Using Linear Optics
In 2011, Aaronson gave a striking proof, based on quantum linear optics, showing that the problem of computing the permanent of a matrix is #P-hard. Aaronson’s proof led naturally to hardness of approximation results for the permanent, and it was arguably simpler than Valiant’s seminal proof of the same fact in 1979. Nevertheless, it did not prove that computing the permanent was #P-hard for an...
متن کاملZero-One Permanent is #P-Complete, A Simpler Proof
In 1979, Valiant proved that computing the permanent of a 01-matrix is #PComplete. In this paper we present another proof for the same result. Our proof uses \black box" methodology, which facilitates its presentation. We also prove that deciding whether the permanent is divisible by a small prime is #P-Hard. We conclude by proving that a polynomially bounded function can not be #P-Complete und...
متن کاملAcase report of delayed Eruption of a permanent molar tooth Associated with complex odontome
An odontome is a slow growing and non-aggressive odonotogenic tumor composed of enamel,dentin,cementum and pulp tissue.complax odontome comprise of an unorganized mass of odonotogenic tissues,morphologically not resembling the normal teeth.in this report,a case of rare odontoma in a ten-years-old boy that caused dalayed eruption of a maxillary right farst permanent molar,buccal expansion of the...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملTesting for Stochastic Non- Linearity in the Rational Expectations Permanent Income Hypothesis
The Rational Expectations Permanent Income Hypothesis implies that consumption follows a martingale. However, most empirical tests have rejected the hypothesis. Those empirical tests are based on linear models. If the data generating process is non-linear, conventional tests may not assess some of the randomness properly. As a result, inference based on conventional tests of linear models can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011